Outer approximation algorithms for DC programs and beyond
نویسندگان
چکیده
منابع مشابه
Outer approximation algorithms for DC programs and beyond
Acknowledgements This thesis is the result of four years of work whereby I have been accompanied and supported by many people. It is my pleasure that I have now the opportunity to express my gratitude to all of them. Without them, this dissertation would not have been possible. I would like to express my deep and sincere gratitude to my supervisors, Professors Giancarlo Bigi and Antonio Frangio...
متن کاملOuter approximation algorithms for canonical DC problems
The paper discusses a general framework for outer approximation type algorithms for the canonical DC optimization problem. A thorough analysis of properties which guarantee convergence is carried out: different sets of general conditions are proposed and compared. They are exploited to build six different algorithms, which include the first cutting plane algorithm proposed by Tuy but also new o...
متن کاملA Computational Comparison of Branch and Bound and Outer Approximation Algorithms for Mixed Integer Nonlinear Programs
In this paper we compare the performance of two codes for convex mixed integer nonlinear programs on a number of test problems The rst code uses a branch and bound algorithm The second code is a commer cially available implementation of an outer approximation algorithm The comparison demonstrates that both approaches are generally capable of solving the test problems However there are signi can...
متن کاملtight frame approximation for multi-frames and super-frames
در این پایان نامه یک مولد برای چند قاب یا ابر قاب تولید شده تحت عمل نمایش یکانی تصویر برای گروه های شمارش پذیر گسسته بررسی خواهد شد. مثال هایی از این قاب ها چند قاب های گابور، ابرقاب های گابور و قاب هایی برای زیرفضاهای انتقال پایاست. نشان می دهیم که مولد چند قاب تنک نرمال شده (ابرقاب) یکتا وجود دارد به طوری که مینیمم فاصله را از ان دارد. همچنین مسایل مشابه برای قاب های دوگان مطرح شده و برخی ...
15 صفحه اولApproximation algorithms for covering/packing integer programs
Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the problem of computing min{cx : x ∈ Z+, Ax ≥ a, Bx ≤ b, x ≤ d}. We give a bicriteria-approximation algorithm that, given ε ∈ (0, 1], finds a solution of cost O(ln(m)/ε) times optimal, meeting the covering constraints (Ax ≥ a) and multiplicity constraints (x ≤ d), and satisfying Bx ≤ (1 + ε)b + β, wher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2010
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-010-0126-8